منابع مشابه
Modularity of Completeness Revisited
One of the key results in the eld of modularity for Term Rewriting Systems is the modularity of completeness for left linear TRSs established by Toyama Klop and Barendregt in TKB The proof however is quite long and involved In this paper a new proof of this basic result is given which is both short and easy employing the powerful technique of pile and delete already used with success in proving...
متن کاملApproximate common knowledge revisited
Suppose we replace ``knowledge'' by ``belief with probability p'' in standard de®nitions of common knowledge. Very di ̈erent notions arise depending on the exact de®nition of common knowledge used in the substitution. This paper demonstrates those di ̈erences and identi®es which notion is relevant in each of three contexts: equilibrium analysis in incomplete information games, best response dynam...
متن کاملGeneralized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on the number of trials and the level already reached. If the depency is only on the level already reached, this is an algorithm called approximate counting. Two random variables, Xn (level reached after n trials) and Yk...
متن کاملApproximate Range Counting Revisited
We study range-searching for colored objects, where one has to count (approximately) the number of colors present in a query range. The problems studied mostly involve orthogonal rangesearching in two and three dimensions, and the dual setting of rectangle stabbing by points. We present optimal and near-optimal solutions for these problems. Most of the results are obtained via reductions to the...
متن کاملApproximate Distance Oracles Revisited
Let G be a geometric t-spanner in E with n vertices and m edges, where t is a constant. We show that G can be preprocessed in O(m log n) time, such that (1 + ")-approximate shortest-path queries in G can be answered in O(1) time. The data structure uses O(n log n) space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2020
ISSN: 0097-5397,1095-7111
DOI: 10.1137/18m1173873